High-Density Knapsack Cryptosystem using Shifted-Odd and Super-Increasing Sequence

نویسندگان

چکیده

It is proven that many public-key cryptosystems would be broken by the quantum computer. The knapsack cryptosystem which based on subset sum problem has potential to a quantum-resistant cryptosystem. Murakami and Kasahara proposed SOSI trapdoor sequence made combining shifted-odd (SO) super-increasing (SI) in modular This paper firstly show key generation method could not achieve secure density against low-density attack. Second, we propose high-density confirmed scheme

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cryptanalysis of Another Knapsack Cryptosystem

At the last Eurocrypt meeting, a cryptosystem based on modular knapsacks was proposed (see [11]). We show that this system is not secure, and we describe two different ways of breaking it using the LLL algorithm. This is one more example of a cryptosystem that can be broken using this powerful algorithm (see [1, 13, 14]). For more details, the reader should refer to [4]. 1 The proposed cryptosy...

متن کامل

Knapsack Cryptosystem on Elliptic Curves

—The LLL algorithm is strong algorithm that de-crypts the additional type Knapsack cryptosystem. However, the LLL algorithm is not applicable in the addition in the group that rational points of elliptic curves on finite fields do. Therefore, we think the Knapsack cryptosystem constructed on elliptic curves. By using the pairing for the decryption, it is shown to be able to make the computation...

متن کامل

Knapsack Public-Key Cryptosystem Using Chinese Remainder Theorem

The realization of the quantum computer will enable to break publickey cryptosystems based on factoring problem and discrete logarithm problem. It is considered that even the quantum computer can not solve NP -hard problem in a polynomial time. The subset sum problem is known to be NP -hard. Merkle and Hellman proposed a knapsack cryptosystem using the subset sum problem. However, it was broken...

متن کامل

Linearly shift knapsack public-key cryptosystem

In this paper, we propose two algorithms to improve the Merkle-Hellman knapsack public-key cryptosystem. First, we propose an approach to transform a superincreasing sequence to a " high den-sity'' knapsack sequence. The algorithm is easy to implement and eliminates the redundancy of many knapsack cryptosystems. Second, a linearly shift method is used to improve the security of the knapsack pub...

متن کامل

Enhancements of the Non-linear Knapsack Cryptosystem

Nowadays all existing public key cryptosystems are classified into three categories relied on different mathematical foundations. The first one is based on the difficulty of factoring the product of two big prime numbers. The representatives are the RSA and the Rabin cryptosystems. The second one such as the ElGamal cryptosystem is based on the discrete logarithm problem. The last one is based ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

سال: 2023

ISSN: ['1745-1337', '0916-8508']

DOI: https://doi.org/10.1587/transfun.2023tal0004